Transforming Abstract Interpretations by Abstract Interpretation New Challenges in Language-based Security

نویسندگان

  • Roberto Giacobazzi
  • Isabella Mastroeni
چکیده

In this paper we exploit abstract interpretation for transforming abstract domains and semantics. The driving force in both transformations is making domains and semantics, i.e. abstract interpretations themselves, complete, namely precise, for some given observation. We prove that a common geometric pattern is shared by all these transformations, both at the domain and semantic level. This pattern is based on the notion residuated closures, which in our case can be viewed as an instance of abstract interpretation. We consider these operations in the context of language-based security, and show how domain and semantic transformations model security policies and attackers, opening new perspectives in the model of information flow in programming languages.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized Abstract Non-interference: Abstract Secure Information-Flow Analysis for Automata

Secure Information-flow Analysis for Automata Roberto Giacobazzi and Isabella Mastroeni Dipartimento di Informatica Università di Verona, Italy (roberto.giacobazzi@ | mastroeni@sci.)univr.it Abstract. Abstract non-interference has been introduced as a weakening non-interference which models attackers as abstract interpretations (i.e., static analyzers) of programming language semantics. In this...

متن کامل

Language-based Security Abstract Non-interference

Interpretation Consider C = ℘(Z): [Cousot & Cousot’77] C A {0} {0,!1,!2,!3,...} 0! {!2,!3} Abstract domain 0+ ? {0,1,2,3,...} Language-based Security: Abstract Non-Interferece – p.3/32 Abstract Interpretation Consider C = ℘(Z): [Cousot & Cousot’77]Interpretation Consider C = ℘(Z): [Cousot & Cousot’77] Abstract domain C A {0} {0,1,2,3,...} {0,!1,!2,!3,...} 0! {!2,!3} 0+ ?domain C A {0} {0,1,2,3,...

متن کامل

A Galois Connection Calculus for Abstract Interpretation (Auxiliary Materials)

We introduce a Galois connection calculus for language independent specification of abstract interpretations used in programming language semantics, formal verification, and static analysis. This Galois connection calculus and its type system are typed by abstract interpretation.

متن کامل

Generalized Strong Preservation by Abstract Interpretation

Many algorithms have been proposed for reducing the state space of a Kripke structure in order to obtain a minimal abstract structure that strongly preserves a given temporal specification language. These are partition refinement algorithms, namely they work on standard abstract models which are partitions of the state space States . In an abstract interpretation-based view, we show that state ...

متن کامل

Semantics-based code obfuscation by abstract interpretation

In recent years code obfuscation has attracted research interest as a promising technique for protecting secret properties of programs. The basic idea of code obfuscation is to transform programs in order to hide their sensitive information while preserving their functionality. One of the major drawbacks of code obfuscation is the lack of a rigorous theoretical framework that makes it difficult...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008